Further analysis of minimum residual iterations
نویسنده
چکیده
The convergence behavior of a number of algorithms based on minimizing residual norms over Krylov subspaces, is not well understood. Residual or error bounds currently available are either too loose or depend on unknown constants which can be very large. In this paper we take another look at traditional as well as alternative ways of obtaining upper bounds on residual norms. In particular, we derive new inequalities which utilize Chebyshev polynomials and compare them with standard inequalities.
منابع مشابه
A black box generalized conjugate gradient minimum residual method based on variable preconditioners and local element approximations
In order to control the accuracy of a preconditioner for an outer iterative process one often involves variable preconditioners. The variability may for instance be due to the use of inner iterations in the construction of the preconditioner. Both the outer and inner iterations may be based on some conjugate gradient type of method, e.g. generalized minimum residual methods. A background for su...
متن کاملEstimates of the Norm of the Error in Solving Linear Systems with FOM and GMRES
We provide formulas for the norm of the error when solving non symmetric linear systems with the full orthogonalization method (FOM) and the generalized minimum residual method (GMRES) as well as relations between the error norm and the residual norm. From these formulas we are able to compute estimates of the norm of the error during the iterations. Since stopping criteria based on the norm of...
متن کاملLagrange Based Color Image Demosaicing Using Iterative Residual Interpolation
Interpolation technique in color image demosaicing is a big challenge to obtain RGB channels as perceived by humans. The existing demosaicing methods adopt i terative residual interpolation (IRI) technique, which performs iterations on the residuals. These methods are unable to reconstruct G channel efficiently with less iterations. Hence a new demosaicing method is proposed, which performs les...
متن کاملA Lossless Image Coder Integrating Predictors and Block-Adaptive Prediction
This paper proposes a lossless image compression scheme integrating well-known predictors and Minimum Rate Predictor (MRP). Minimum Rate Predictor is considered as one of the most successful method in coding rates for lossless grayscale image compression so far. In the proposed method, the linear predictor is designed as the combination of causal neighbors together with well-known predictors (G...
متن کاملInvestigating the Effects of MINRES with Local Reorthogonalization
The minimum residual method, MINRES, is an iterative method for solving a n x n linear system, Ax = b, where is A is a symmetric matrix. It searches for a vector, xk, in the k th Krylov subspace that minimizes the residual, rk = b − Axk. Due to the symmetric nature, the vectors are computed to be the Lanczos vectors, which simplifies to a three-term recurrence, where vk+1 is computed as a linea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 7 شماره
صفحات -
تاریخ انتشار 2000